#include "stack.h"
#include "queue.h"
#include "priority_queue.h"
#include <iostream>
#include <vector>
#include <list>
#include <deque>


using namespace std;

void test_stack1()
{
	yiwei::stack<int, deque<int>> st;
	st.push(1);
	st.push(2);
	st.push(3);
	st.push(4);
	st.push(5);
	st.push(6);

	while (!st.empty())
	{
		cout << st.top() << " ";
		st.pop();
	}
	cout << endl;


}

void test_queue1()
{
	yiwei::queue<int,deque<int>> q;
	q.push(1);
	q.push(2);
	q.push(3);
	q.push(4);

	while (!q.empty())
	{
		cout << q.front() << " ";
		q.pop();
	}
	cout << endl;
}

void test_priority_queue()
{
	yiwei::priority_queue<int,vector<int>,greater<int>> pq;
	pq.push(2);
	pq.push(1);
	pq.push(6);
	pq.push(4);
	pq.push(8);
	pq.push(3);


	while (!pq.empty())
	{
		cout << pq.top() << " ";
		pq.pop();
	}
	cout << endl;
}

int main()
{
	//test_stack1();
	//test_queue1();
	test_priority_queue();
	return 0;
}